Inference on Social Effects When the Network Is Unknown Using Convex or Linear Programming
نویسنده
چکیده
The paper considers panel data models with social interactions when the network is unobserved and there are endogenous and exogenous social effects. The system of equations is estimated jointly by a convex program. The method does not require the knowledge of the variances of the errors nor a subgaussian assumption. It is possible to incorporate linear and sign restrictions and to impose that the matrices of endogenous and exogenous social effects have same nonzeros. The confidence sets are obtained by solving convex programs. Because the network is unknown, it is not known which exogenous variable does not have a direct effect and can be a valid excluded instrument for the endogenous variables having a direct effect. Therefore we extend the framework of Gautier and Tsybakov (2011, 2014) which handles unknown exclusion restrictions to systems of simultaneous equations. The confidence sets are robust to identification and can be infinite when there is not enough sparsity/exclusion restrictions, when, for some included endogenous regressor, all instruments are too weak or when the number of time periods is too small. The second half of the paper presents an alternative approach that only relies on linear programming. This is numerically very attractive for the study of large networks.
منابع مشابه
Modelling and Compensation of uncertain time-delays in networked control systems with plant uncertainty using an Improved RMPC Method
Control systems with digital communication between sensors, controllers and actuators are called as Networked Control Systems (NCSs). In general, NCSs encounter with some problems such as packet dropouts and network induced delays. When plant uncertainty is added to the aforementioned problems, the design of the robust controller that is able to guarantee the stability, becomes more complex. In...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کاملA bi-level linear programming problem for computing the nadir point in MOLP
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
متن کاملUsing of Metaheuristic Water Cycle Algorithm in order to Determine Optimal Crop Cultivation across of Genetic Algorithm and linear programming (Case Study: Varamin Irrigation Network)
Due to water use increasing, attention to optimal water resources allocation is needed. In recent decades, the use of intelligent evolutionary methods for optimization of water allocation was focused more by researchers. The aim of this study is to development on water resources planning model that determined the proper cultivation, optimal exploitation of groundwater and surface water resource...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015